Two Notes on Recursive Functions
نویسندگان
چکیده
Introduction. The theory of regressive isols was introduced by J. C. E. Dekker in [7]. The results that we wish to present in this paper belong to this theory and is a continuation of some of our studies in [1], [3] and [4]. We will assume that the reader is familiar with the terminology and some of the main results of the papers listed as references. We let E denote the collection of all nonnegative integers (numbers), A the collection of all isols, A* the collection of all isolic integers, and AB the collection of all regressive isols. If/is a function from a subset of E into E then 8/ will denote its domain and pf its range. Let un and vn be two one-to-one functions from E into E. Then un ̂ * vn, if there is a partial recursive function / such that
منابع مشابه
Another Look at Function Domains
Bove and Capretta have presented a method to deal with partial and general recursive functions in constructive type theory which relies on an inductive characterisation of the domains of the functions. The method separates the logical and the computational aspects of an algorithm, and facilitates the formal verification of the functions being defined. For nested recursive functions, the method ...
متن کاملA Class of Reversible Primitive Recursive Functions
Reversible computing is bi-deterministic which means that its execution is both forward and backward deterministic, i.e. next/previous computational step is uniquely determined. Various approaches exist to catch its extensional or intensional aspects and properties. We present a class RPRF of reversible functions which holds at bay intensional aspects and emphasizes the extensional side of the ...
متن کاملA Survey of Classes of Primitive Recursive Functions
This paper is a transcription of mimeographed course notes titled “A Survey of Classes of Primitive Recursive Functions”, by S.A. Cook, for the University of California Berkeley course Math 290, Sect. 14, January 1967. The notes present a survey of subrecursive function classes (and classes of relations based on these classes,) including Cobham’s class L of polynomial time functions, and Bennet...
متن کاملSequential Computability of a Function: Diagonal Space and Limiting Recursion
We consider the real sequences in I = [0, 1) and real functions on I . A computability notion with respect to the uniformity {Un}, where Un(x) = [ k 2n , k+1 2n ) if x ∈ [ k 2n , k+1 2n ), will be called Dcomputability. An R-computable sequence from I will be shown to be approximated by a recursive sequence of rational numbers with a limiting recursive modulus of convergence with respect to {Un...
متن کاملLecture Notes on Loop Optimizations
Optimizing loops is particularly important in compilation, since loops (and in particular the inner loops) account for much of the executions times of many programs. Since tail-recursive functions are usually also turned into loops, the importance of loop optimizations is further magnified. In this lecture we will discuss two main ones: hoisting loop-invariant computation out of a loop, and opt...
متن کاملTransforming Programs into Recursive Functions
This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010